Reaching a goal with directional uncertainty
نویسندگان
چکیده
منابع مشابه
Reaching a Goal with Directional Uncertainty
We study two problems related to planar motion planning for robots with imperfect control, where, if the robot starts a linear movement in a certain commanded direction, we only know that its actual movement will be con ned in a cone of angle centered around the speci ed direction. First, we consider a single goal region, namely the \region at in nity", and a set of polygonal obstacles, modeled...
متن کاملReaching a Polygon with Directional Uncertainty
Assume a robot that, when directed to move in a particular direction, is guaranteed to move inside a cone of angle centered at the speci ed direction. The robot has to reach a convex polygonal goal G, while avoiding polygonal obstacles of complexity n. We show that the complexity of the safe region, from where the robot can reach the goal with a single linear motion with uncertainty , is O(m+n)...
متن کاملReaching a Goal with
We study two problems related to planar motion planning for robots with imperfect control, where, if the robot starts a linear movement in a certain commanded direction, we only know that its actual movement will be connned in a cone of angle centered around the speciied direction. First, we consider a single goal region, namely the \region at innnity", and a set of polygonal obstacles, modeled...
متن کاملNavigation with uncertainty: reaching a goal in a high collision risk region
We present a probabilistic method for noisy sensor based robotic navigation in dynamic environments. The method generates an optimal trajectory by considering as optimality criteria the probability of not colliding with the obstacles and the probability of accessing an operational position with respect to a moving target object. Estimates of the obstacle's kinematic parameters and measures of c...
متن کاملNAVIGATION WITH UNCERTAINTY I Reaching a Goal in a High Collision Risk Region
We present a probabilistic method for noisy sensor based robotic navigation in dynamic en vironments The method generates an optimal trajectory by considering as optimality criteria the probability of not colliding with the obstacles and the probability of accessing an operational position with respect to a moving target object Estimates of the obstacle s kinematic parameters and measures of co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00237-d